n = int(input())
v = [int(x) for x in input().split(" ")]
maior = max(v)
index = v.index(maior)
v.pop(index)
soma = 0
for i in v:
soma += i
if(soma > maior):
print(soma-maior+1)
else:
print(maior-soma+1)
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long i,k,v,sum,y;
while(cin>>k)
{
sum=0,v=0;
long arr[k];
for(i=0;i<k;i++){
cin>>arr[i];
}
sort(arr,arr+k);
for(i=0;i<k-1;i++)
sum+=arr[i];
cout<<arr[k-1]-sum+1<<endl;
}
return 0;
}221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |